A sequential algorithm for multiblock orthogonal projections to latent structures
نویسندگان
چکیده
منابع مشابه
A Sequential Algorithm for Multiblock Orthogonal Projections to Latent Structures.
Methods of multiblock bilinear factorizations have increased in popularity in chemistry and biology as recent increases in the availability of information-rich spectroscopic platforms has made collecting multiple spectroscopic observations per sample a practicable possibility. Of the existing multiblock methods, consensus PCA (CPCA-W) and multiblock PLS (MB-PLS) have been shown to bear desirabl...
متن کاملSEISMIC DESIGN OPTIMIZATION OF STEEL STRUCTURES BY A SEQUENTIAL ECBO ALGORITHM
The objective of the present paper is to propose a sequential enhanced colliding bodies optimization (SECBO) algorithm for implementation of seismic optimization of steel braced frames in the framework of performance-based design (PBD). In order to achieve this purpose, the ECBO is sequentially employed in a multi-stage scheme where in each stage an initial population is generated based on the ...
متن کاملAn Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comaprisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric. Orthogonal basis is introduced in the vector space. The orthogonal projection of the transformed matrix onto the space formed by the images of consistent matrices is ...
متن کاملLearning orthogonal projections for Isomap
We propose a dimensionality reduction technique in this paper, named Orthogonal Isometric Projection (OIP). In contrast with Isomap, which learns the low-dimension embedding, and solves problem under the classic Multidimensional Scaling (MDS) framework, we consider an explicit linear projection by capturing the geodesic distance, which is able to handle new data straightforward, and leads to a ...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemometrics and Intelligent Laboratory Systems
سال: 2015
ISSN: 0169-7439
DOI: 10.1016/j.chemolab.2015.10.018